Fast Efficient Importance Sampling by State Space Methods

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient High-Dimensional Importance Sampling

The paper describes a simple, generic and yet highly accurate Efficient Importance Sampling (EIS) Monte Carlo (MC) procedure for the evaluation of high-dimensional numerical integrals. EIS is based upon a sequence of auxiliary weighted regressions which actually are linear under appropriate conditions. It can be used to evaluate likelihood functions and byproducts thereof, such as ML estimators...

متن کامل

Space-Efficient Sampling

We consider the problem of estimating nonparametric probability density functions from a sequence of independent samples. The central issue that we address is to what extent this can be achieved with only limited memory. Our main result is a space-efficient learning algorithm for determining the probability density function of a piecewise-linear distribution. However, the primary goal of this p...

متن کامل

Fast Bootstrapping by Combining Importance Sampling and Concomitants

Importance sampling is the old standby method for ob taining accurate tail quantiles of a bootstrap distribution more quickly A newer method a variation of control variates called concomitants is especially attractive in larger problems because its e ciency relative to simple Monte Carlo sampling increases at the rate of p n where n is the sample size We show how to combine these complementary ...

متن کامل

Time Series Analysis by State Space Methods

The purpose of this document is to summarize Part I of the book “Time Series Analysis by State Space Methods ”, written by James Durbin and Siem Jan Koopman.

متن کامل

Efficient Post-processing with Importance Sampling

Introduction Texture filtering is a critical part in many rendering and post-processing methods. If we do it naively, the fragment shader needs to access the texture memory many times to fetch values in the neighborhood of the processed texel. This article presents an efficient filtering algorithm that minimizes the number of texture fetches. The algorithm is based on importance sampling and al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SSRN Electronic Journal

سال: 2012

ISSN: 1556-5068

DOI: 10.2139/ssrn.1996447